LNAI 7788 - Automated Reasoning and Mathematics
نویسندگان
چکیده
This article presents examples of the monumental contributions of Bill McCune to mathematics, logic, computer science, and especially automated reasoning. The examples are presented in the form of short stories and recollections of the author during his long association with Bill. In addition to Bill’s accomplishments as a researcher, the author provides personal memories giving glimpses into Bill’s complex personality and his generosity as a collaborator. 1 Perspective and Genesis Perhaps you have wondered what would result if you had the opportunity to spend thousands of hours with a great mind. For more than two decades, I had that opportunity as I shared research time with my esteemed colleague William (Bill) McCune. We shared many ideas, conjectures, and, yes, guesses. Each of us had two main goals. The first goal was to formulate enhancements for an automated reasoning program, enhancements that would substantially add to its power. The second goal was to employ the program in a way that would contribute to various areas of mathematics and logic. From the viewpoint of making contributions to mathematics and logic, Bill and I had a marvelous automated assistant; indeed, in 1988, if memory serves, he designed and implemented the automated reasoning program called OTTER. (We did have access to a program designed at Argonne before OTTER was produced.) In but four months, even though Bill was also involved in research of different aspects, he wrote more than 30,000 lines of code, producing a program that, from then until now, has exhibited the smallest number of bugs. Yes, his effort was and is monumental; indeed, when you obtain a conclusion, a set of conclusions, a proof, you can assume with almost total certainty that all is in order. Also important is the robustness of OTTER, permitting you to have it search for desired objects for weeks, if needed, without stopping. In this article, I shall tell a number of short stories that provide ample evidence of Bill’s inventive mind, his accurate insights, and his impeccable professionalism. His successes in the context of enhancements have played a key role in much of what has occurred in the past ten years. As I shall highlight here, Bill answered (with one of his programs) open questions in areas that include group theory, lattice theory, Boolean algebra, combinatory logic, and—so impressive—Robbins algebra; for various open questions, see Chapter 7 of [14]. This work was supported by the U.S. Department of Energy, under Contract DEAC02-06CH11357. M.P. Bonacina and M.E. Stickel (Eds.): McCune Festschrift, LNAI 7788, pp. 1–14, 2013. c © Springer-Verlag Berlin Heidelberg 2013
منابع مشابه
The Nuprl Open Logical Environment
D. McAllester, ed. 17 International Conference on Automated Deduction, LNAI 1831, pp. 170–176, c ©Springer Verlag, 2000. Abstract. The Nuprl system is a framework for reasoning about mathematics and programming. Over the years its design has been substantially improved to meet the demands of large-scale applications. Nuprl LPE, the newest release, features an open, distributed architecture cent...
متن کاملJProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
R. Gore, A. Leitsch, T. Nipkow, eds. International Joint Conference on Automated Reasoning (IJCAR 2001), LNAI 2083, pp. 421–426, c ©Springer Verlag, 2001. Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview o...
متن کاملA Proof Environment for the Development of Group Communication Systems
C. & H. Kirchner, ed. 15 International Conference on Automated Deduction (CADE-15), LNAI 1421, pp. 317–331, c ©Springer Verlag, 1998. Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction applicable to the implementation of real-world systems by linking the Ensemble group co...
متن کامل2 0 Fe b 20 07 The Bedwyr system for model checking over syntactic expressions
syntax. In Glynn Winskel, editor, 12th Symp. on Logic in Computer Science, pages 434–445, Warsaw, Poland, July 1997. IEEE Computer Society Press.4. Dale Miller. Abstract syntax for variable binders: An overview. In John Lloydand et. al., editors, Computational Logic CL 2000, number 1861 in LNAI, pages239–253. Springer, 2000.5. Dale Miller and Alwen Tiu. A proof theory for generi...
متن کاملReasoning in the OWL 2 Full Ontology Language Using First-Order Automated Theorem Proving
OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language. Consistency and entailment checking are known to be undecidable for OWL 2 Full. We have translated a large fragment of the OWL 2 Full semantics into firstor...
متن کامل